skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Basu, Ayush"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, Discrete Mathematics)
    Free, publicly-accessible full text available May 1, 2026
  2. ; ; ; (, The Electronic Journal of Combinatorics)
    In their classical paper, Erdős, Goodman and Pósa studied the representation of a graph with vertex set $[n]$ by a family of subsets $$S_1,\dots, S_n$$ with the property that $$\{i,j\}$$ is an edge if and only if $$S_i\cap S_j\neq \emptyset$$. In this note, we consider a similar representation of bounded degree $$r$$-uniform hypergraphs and establish some bounds for a corresponding problem. 
    more » « less
    Free, publicly-accessible full text available February 28, 2026